DEGREES BOUNDING PRINCIPLES AND UNIVERSAL INSTANCES IN REVERSE MATHEMATICS LUDOVIC PATEY ABSTRACT. A Turing degree d bounds a principle P of reverse mathematics if every computable instance of P has a d-computable soluti

Source URL: ludovicpatey.com

• Mathematics
• Mathematical analysis
• Theory of computation
• Computability theory
• Theoretical computer science
• Computation in the limit
• Computable function
• Differential forms on a Riemann surface
• Congruence lattice problem

Metropolis Algorithm for solving Shortest Lattice Vector Problem(SVP) Ajitha Shenoy K B Department of Computer Science and Engineering Indian Institute of Technology

Source URL: www.cse.iitk.ac.in

Characterizing algebras and varieties by weak congruence lattices and open problems ˇ selja Andreja Tepavˇcevi´c and Branimir Seˇ Department of Mathematics and Informatics, Faculty of Sciences

Source URL: spot.colorado.edu

• Lie groups
• Algebra
• Lattice theory
• Congruence relation
• Modular arithmetic
• Compact element
• Quotient algebra
• Congruence
• Lattice
• Congruence lattice problem
• Distributive homomorphism

Denitions and construction Topologies on canonical extensions Subspace topologies Canonical extensions of lattices Andrew Craig

Source URL: spot.colorado.edu

• Lattice theory
• Lattice
• Complete lattice
• Dual space
• Distributive lattice
• Topological space
• Congruence lattice problem

Near-critical scaling limits in 2d statistical physics Christophe Garban (Université Lyon 1), Gabor Pete (Alfréd Rényi Institute of Mathematics and Budapest University of Technology & Economics) The general problem ad

Source URL: www.7ecm.de

• Mathematics
• Academia
• Quantum field theory
• Oded Schramm
• Lattice models
• Critical phenomena
• Combinatorics
• Phase transitions
• Renormalization group
• Ising model
• Percolation
• Oded

Chapter 1 From Particles to Fields The aim of this section is to introduce the language and machinery of classical and quantum field theory through its application to the problem of lattice vibrations in a solid. In doin

Source URL: www.tcm.phy.cam.ac.uk

Integer Optimization Toolbox Pooya Ronagh∗ August 13, 2013 In what follows, we explain how the Integer Optimization Toolbox approaches the problem of minimization of a (low degree) polynomial over an integer lattice. I

Source URL: www.1qbit.com

Strong CP problem and axion on the lattice Ryuichiro Kitano (KEK) based onwith Nori Yamada (KEK)

Source URL: theory.fnal.gov

On the Lattice Isomorphism Problem Ishay Haviv∗ Oded Regev† Abstract

Source URL: www2.mta.ac.il

The Remote Set Problem on Lattices Ishay Haviv∗ June 11, 2012 Abstract We initiate studying the Remote Set Problem (RSP) on lattices, which given a lattice asks to

Source URL: www2.mta.ac.il